Skeleton-Based Orienteering for Level Set Estimation

نویسندگان

  • Lorenzo Bottarelli
  • Manuele Bicego
  • Jason Blum
  • Alessandro Farinelli
چکیده

In recent years, the use of unmanned vehicles for monitoring spatial environmental phenomena has gained increasing attention. Within this context, an interesting problem is level set estimation, where the goal is to identify regions of space where the analyzed phenomena (for example the PH value in a body of water) is above or below a given threshold level. Typically, in the literature this problem is approached with techniques which search for the most interesting sampling locations to collect the desired information (i.e., locations where we can gain the most information by sampling). However, the common assumption underlying this class of approaches is that acquiring a sample is expensive (e.g., in terms of consumed energy and time). In this paper, we take a different perspective on the same problem by considering the case where a mobile vehicle can continuously acquire measurements with a negligible cost, through high rate sampling sensors. In this scenario, it is crucial to reduce the path length that the mobile platform executes to collect the data. To address this issue, we propose a novel algorithm, called Skeleton-Based Orienteering for Level Set Estimation (SBOLSE). Our approach starts from the LSE formulation introduced in [10] and formulates the level set estimation problem as an orienteering problem. This allows one to determine informative locations while considering the length of the path. To combat the complexity associated with the orienteering approach, we propose a heuristic approach based on the concept of topological skeletonization. We evaluate our algorithm by comparing it with the state of the art approaches (i.e., LSE and LSE-batch) both on a real world dataset extracted from mobile platforms and on a synthetic dataset extracted from CO2 maps. Results show that our approach achieves a near optimal classification accuracy while significantly reducing the travel distance (up to 70% w.r.t LSE and 30% w.r.t. LSE-batch).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Sea Exploration Problem: Data-driven Orienteering on a Continuous Surface

This paper describes a problem arising in sea exploration, where the aim is to schedule the expedition of a ship for collecting information about the resources on the seafloor. The aim is to collect data by probing on a set of carefully chosen locations, so that the information available is optimally enriched. This problem has similarities with the orienteering problem, where the aim is to plan...

متن کامل

Research on Team Orienteering Problem with Dynamic Travel Times

In the team orienteering problem (TOP) a set of locations is given, each with a score. The goal is to determine a fixed number of routes, limited in length, that visit some locations and maximize the sum of the collected scores. The team orienteering problem is often used as a starting point for modeling many combinatorial optimization problems. This paper studies the dynamic team orienteering ...

متن کامل

Rapidly exploring Random Orienteering

Data gathering in the physical world is tedious and often risky. Robots are ideally suited for such applications. The objective of a data gathering robot is to travel between two points maximizing the information it gains while not exceeding energy or cost constraints. This problem can be formalized as that of finding budgeted routes in a graph such that the reward collected by the route is max...

متن کامل

Dynamic Orienteering on a Network of Queues

We propose a stochastic orienteering problem on a network of queues with time windows at customers. While this problem is of wide applicability, we study it in the context of routing and scheduling a textbook salesperson who visits professors on campus to gain textbook adoptions. The salesperson must determine which professors to visit and how long to wait in queues at each professor. We model ...

متن کامل

Automated Parameterisation of a Metaheuristic for the Orienteering Problem

Developing metaheuristics requires in general a lot of work tuning different parameters. This paper presents a two–level algorithm to tackle this problem: an upper–level algorithm is used to determine the most appropriate set of parameters for a lower–level metaheuristic. This approach is applied to an Ant Colony Optimisation (ACO) metaheuristic that was designed to solve the Orienteering Probl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016